Secure Data-Dependent Branching via Speculative Parallelism
نویسندگان
چکیده
We propose a mechanism to securely execute code containing data-dependent branches by speculatively executing both sides of the branch. These branches must be specially constructed, but we use this construction to induce performance. Attention is given to the on-chip infrastructure needed for these changes as well as the new mechanisms required in existing instrumentation and simulation software such as SMTSIM. Also provided are several example code segments where this technique could be applied. The increase in security and performance on these example segments is discussed and estimated. Finally, we explore the limitations in our work at the present point.
منابع مشابه
Symbolic Scheduling Techniques
This paper describes an exact symbolic formulation of resource-constrained scheduling which allows speculative operation execution in arbitrary forward-branching control/data paths. The technique provides a closed-form solution set in which all satisfying schedules are encapsulated in a compressed OBDD-based representation. An iterative construction method is presented along with benchmark resu...
متن کاملSpeculative Parallel & Optimized Execution on Multi-Core Platforms
and Goals: The goal of the proposed research is to enable parallelization and optimization of applications for execution on contemporary multi-core platforms. Via code annotations, the user will provide hints for the presence of parallelism and the usage of static and dynamic data structures. These hints will enable exploitation of potential parallelism in these applications with high levels of...
متن کاملSanta Barbara Symbolic Scheduling Techniques
This thesis describes an exact symbolic formulation of control-dependent, resource-constrained scheduling. The technique provides a closed-form solution set in which all satisfying schedules are encapsulated in a compressed Binary Decision Diagram (BDD) representation. This solution format greatly increases the flexibility of the synthesis task by enabling incremental incorporation of additiona...
متن کاملClustered Data Parallelism
Many data layout optimizations cluster data accesses and memory into high-locality groups in order to optimize for the memory hierarchy. In this paper, we demonstrate that similar clustering program transformations enable efficient vectorization. We call this approach clustered data parallelism (CDP). CDP enables fast and power-efficient parallelism by partitioning a data structure into cluster...
متن کاملDynamic Parallel Media Processing using Speculative Broadcast Loop ( SBL ) ( Extended
This paper presents the results of a study of dynamic parallel media processing using Speculative Broadcast Loop (SBL), a speculative run-time loop-level parallelization method. Due to processing regularity, multimedia applications typically contain extensive parallelism. Data parallelism between independent loop iterations may be supported by subword parallelism methods, but much of the data p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007